Routing of Railway Carriages
نویسندگان
چکیده
In the context of making timetables for railway companies the following railway carriage routing problem occurs. Given a timetable containing rail links with departure and destination times/stations and the composition of the trains, nd a routing of railway carriages such that always the needed carriages are available if a train departs. We will present a local search approach for this routing problem for the railway carriages. The approach is based on an integer multi-commodity network ow formulation of the problem. Computational results for a real world instance are given.
منابع مشابه
Routing of Railway Carriages: A Case Study
In the context of organizing timetables for railway companies the following railway carriage routing problem occurs. Given a timetable containing rail links with departure and destination times/stations and the composition of the trains, find a routing of railway carriages such that the required carriages are always available when a train departs. We will present a local search approach for thi...
متن کاملEngineering South Building S111 and S112 S111 Time Student Name Topic Supervisor(s) Cfd Modelling of Personalised Ventilation System in High-speed Railway Carriages
s of Presentations CFD modelling of personalised ventilation system in high-speed railway carriages
متن کاملA particle swarm optimization method for periodic vehicle routing problem with pickup and delivery in transportation
In this article, multiple-product PVRP with pickup and delivery that is used widely in goods distribution or other service companies, especially by railways, was introduced. A mathematical formulation was provided for this problem. Each product had a set of vehicles which could carry the product and pickup and delivery could simultaneously occur. To solve the problem, two meta-heuristic methods...
متن کاملRotation Planning of Locomotive and Carriage Groups with Shared Capacities
In a large railway passenger traffic network, a given set of trips or service blocks are to be serviced by equipment consisting of several groups of locomotives/carriages. The allowed groups per service block are predefined as patterns or multisets of locomotives and carriages. A given type of locomotive/carriage may occur with varying numbers in several groups. We search for a cost-minimal ass...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Global Optimization
دوره 27 شماره
صفحات -
تاریخ انتشار 2003